Vertex Ramsey Problems in the Hypercube
نویسندگان
چکیده
منابع مشابه
Vertex Turán problems in the hypercube
Let Qn be the n-dimensional hypercube: the graph with vertex set {0, 1} and edges between vertices that differ in exactly one coordinate. For 1 ≤ d ≤ n and F ⊆ {0, 1} we say that S ⊆ {0, 1} is F -free if every embedding i : {0, 1} → {0, 1} satisfies i(F ) 6⊆ S. We consider the question of how large S ⊆ {0, 1} can be if it is F -free. In particular we generalise the main prior result in this are...
متن کاملA Ramsey-type result for the hypercube
We prove that for every fixed k and ` ≥ 5 and for sufficiently large n, every edge coloring of the hypercube Qn with k colors contains a monochromatic cycle of length 2`. This answers an open question of Chung. Our techniques provide also a characterization of all subgraphs H of the hypercube which are Ramsey, i.e., have the property that for every k, any k-edge coloring of a sufficiently large...
متن کاملThe vertex size-Ramsey number
In this paper, we study an analogue of size-Ramsey numbers for vertex colorings. For a given number of colors r and a graph G the vertex size-Ramsey number of G, denoted by R̂v(G, r), is the least number of edges in a graph H with the property that any r-coloring of the vertices of H yields a monochromatic copy of G. We observe that Ωr(∆n) = R̂v(G, r) = Or(n ) for any G of order n and maximum deg...
متن کاملThe Ramsey number of the clique and the hypercube
Ramsey theory, basics r(n, s): smallest N such that any colouring of the edges of K N with blue and red contains a blue clique on n vertices or a red clique on s vertices
متن کاملDecomposing the vertex set of a hypercube into isomorphic subgraphs
Let G be an induced subgraph of the hypercube Qk for some k. We show that if |G| is a power of 2 then, for sufficiciently large n, the vertex set of Qn can be partitioned into induced copies of G. This answers a question of Offner. In fact, we prove a stronger statement: if X is a subset of {0, 1} for some k and if |X | is a power of 2, then, for sufficiently large n, {0, 1} can be partitioned ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2012
ISSN: 0895-4801,1095-7146
DOI: 10.1137/110832239